Jointly Iterative Decoding of Low-Density Parity Check codes (LDPC) coded Continues Phase Modulation (CPM)
نویسندگان
چکیده
This paper investigates the performance of a LowDensity Parity Check codes (LDPC)-coded system transmitted over A WGN channels using octal partial response Continuous Phase Modulation (CPM). The system provides an attractive option for spectral efficient communications systems. The CPM modulator can be decomposed into a ring continuous-phase encoder (CPE) followed by a memoryless modulator (MM), where the CPE is as the same algebra as convolutional code. With a pragmatic approach, The LDPC codes are designed through the use of the proposed analysis technique based on extrinsic information transfer (EXIT) charts. We propose a belief propagation (BP)-based iterative decoding algorithm at the receiver. The hybrid design combined with iterative decoding yield very good performances compare with the conventional communication schemes. The results show the considerable superiority of the iterative algorithm.
منابع مشابه
Design of serial concatenated MSK schemes based on density evolution
We consider the design of convolutional codes and low-density parity-check (LDPC) codes with minimum-shift keying (MSK) when the receiver employs iterative decoding and demodulation. The main idea proposed is the design of coded schemes that are well matched to the iterative decoding algorithm being used rather than to hypothetical maximum-likelihood decoding. We first show that the design is c...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملLow-complexity LDPC coded BICM-ID with orthogonal modulations
A low-complexity low density parity check (LDPC) coded bit-interleaved coded modulation with iterative decoding (BICM-ID) scheme with orthogonal modulations is proposed. With a novel mapping strategy of coded bits to symbols, the proposed scheme is equivalent to a generalised LDPC code with Hadamard constraints and thus orthogonal demodulation can be merged into the iterative LDPC decoding proc...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملPerformance Bound for Finite-Length LDPC Coded Modulation
Coded modulation systems based on low density parity check (LDPC) codes of finite lengths are considered. The union bounds on the bit error probabilities of the maximum likelihood (ML) decoding are presented for both additive white Gaussian noise (AWGN) and flat Rayleigh fading channels. The tightness of the derived bound is verified by simulating the ML decoding of a very short LDPC code. For ...
متن کامل